A Definition of General Weighted Fairness and its Support in Explicit Rate Switch Algorithms
نویسندگان
چکیده
In this paper we give a general definition of weighted fairness and discuss how a pricing policy can be mapped to general weighted (GW) fairness. The GW fairness can be achieved by calculating the ExcessFairshare (weighted fairshare of the left over bandwidth) for each VC. We show how a switch algorithm can be modified to support the GW fairness by using the ExcessFairshare term. We use ERICA+ as an example switch algorithm and show how it can be modified to achieve the general fairness. Simulations results are presented to demonstrate that, the modified switch algorithm achieves GW fairness. An analytical proof for convergence of the modified ERICA+ algorithm is given in the appendix.
منابع مشابه
General weighted fairness and its support in explicit rate switch algorithms
This paper gives a new definition of general weighted (GW) fairness and shows how this can achieve various fairness definitions, such as those mentioned in the ATM Forum TM 4.0 specifications. The GW fairness can be achieved by calculating the ExcessFairshare (weighted fairshare of the left over bandwidth) for each VC. We show how a switch algorithm can be modified to support the GW fairness by...
متن کاملGeneral weighted fairness and its support in explicit rate switch algorithmsq
This paper gives a new definition of general weighted (GW) fairness and shows how this can achieve various fairness definitions, such as those mentioned in the ATM Forum TM 4.0 specifications. The GW fairness can be achieved by calculating the ExcessFairshare (weighted fairshare of the left over bandwidth) for each VC. We show how a switch algorithm can be modified to support the GW fairness by...
متن کاملGeneral Weighted Fairness and its support in Deficit Round Robin with Fragmentation in IEEE 802.16 WiMAX
In wireless networks, the definition of fair resource allocation is ambiguous primarily because the wireless channel condition is not constant over time and distance. Two main ways to define fair resource allocation are: by number of allocated slots, i.e., temporalfainess, or the number of transmitted bytes, throughput-fairness. In wireless broadband networks, the quality of services level is a...
متن کاملA General Methodology for Designing Eecient Traac Scheduling and Shaping Algorithms
We introduce a general methodology for designing integrated shaping and scheduling algorithms for packet networks that provide fairness, low end-to-end delay, and low burstiness. The methodology is based on integrating a shaping mechanism with a scheduler from the class of Rate-Proportional Servers (RPS) deened in 10]. The resulting algorithms provide an end-to-end delay bound identical to that...
متن کاملDesigning Efficient Explicit-Rate Switch Algorithm with Max-Min Fairness for ABR Service Class in ATM Networks
A rate-based congestion control algorithm regulates cell emission rate of source end systems based on feedback information from the network. It was standardized by the ATM Forum for application to an ABR (Available Bit Rate) service class. In the standard, two types of congestion notification methods of the switch are specified: EFCI marking and explicit-rate marking. In this paper, we focus on...
متن کامل